Parallel Approximate Inverse Preconditioners
نویسندگان
چکیده
There has been much excitement recently over the use of approximate inverses for parallel preconditioning. The preconditioning operation is simply a matrix-vector product, and in the most popular formulations, the construction of the approximate inverse seems embarassingly parallel. However, diiculties arise in practical parallel implementations. This paper will survey approximate inverse preconditioners, and discuss the wide variety of options, such as for sparsity pattern selection. We address the pros and cons of each method, and put the methods into perspective.
منابع مشابه
Some Preconditioners for Block Pentadiagonal Linear Systems Based on New Approximate Factorization Methods
In this paper, getting an high-efficiency parallel algorithm to solve sparse block pentadiagonal linear systems suitable for vectors and parallel processors, stair matrices are used to construct some parallel polynomial approximate inverse preconditioners. These preconditioners are appropriate when the desired target is to maximize parallelism. Moreover, some theoretical results about these pre...
متن کاملILU and IUL factorizations obtained from forward and backward factored approximate inverse algorithms
In this paper, an efficient dropping criterion has been used to compute the IUL factorization obtained from Backward Factored APproximate INVerse (BFAPINV) and ILU factorization obtained from Forward Factored APproximate INVerse (FFAPINV) algorithms. We use different drop tolerance parameters to compute the preconditioners. To study the effect of such a dropping on the quality of the ILU ...
متن کاملToward an Effective Sparse Approximate Inverse Preconditioner
Sparse approximate inverse preconditioners have attracted much attention recently, because of their potential usefulness in a parallel environment. In this paper, we explore several performance issues related to effective sparse approximate inverse preconditioners (SAIPs) for the matrices derived from PDEs. Our refinements can significantly improve the quality of existing SAIPs and/or reduce th...
متن کاملFactorized approximate inverse preconditioning of a parallel sparse eigensolver
We exploit an optimization method, called DACG, which sequentially computes the smallest eigenpairs of a symmetric, positive deenite, generalized eigenproblem, by CG minimizations of the Rayleigh quotient over subspaces of decreasing size. In this paper we analyze the eeectiveness of the approximate inverse preconditioners, AINV and FSAI as DACG preconditioners for the solution of Finite Elemen...
متن کاملA robust approximate inverse preconditioner based on the Sherman-Morrison formula∗
To solve a large, and sparse linear system Ax = b; (1) an approximate solution of (1) is usually obtained by using a preconditioned iterative Krylov subspace method [6]. In this work we focus on factorized approximate inverse preconditioners, in this class of preconditioners two matrices such that its product is an approximation of the inverse of A are computed and stored explicitely. Therefore...
متن کامل